Discrete Mobile Centers Jie Gao∗ Leonidas J. Guibas∗ Li Zhang‡

Source URL: geometry.stanford.edu

• Cluster analysis
• Data mining
• Geostatistics
• Set cover problem
• Randomized algorithm
• Logarithm
• Data stream clustering
• Polynomial interpolation

External String Sorting: Faster and Cache-Oblivious Rolf Fagerberg? , Anna Pagh?? , and Rasmus Pagh∗∗ Abstract. We give a randomized algorithm for sorting strings in external memory. For K binary strings comprising N

Source URL: www.it-c.dk

A Randomized Sublinear Time Parallel GCD Algorithm ∗ for the EREW PRAM Jonathan P. Sorenson Computer Science and Software Engineering, Butler University Indianapolis, INUSA

Source URL: www.ants9.org

Some Security Aspects of the MIST Randomized Exponentiation Algorithm Colin D. Walter

Source URL: www.chesworkshop.org

Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples Benjamin Doerr, Michael Gnewuch, and Magnus Wahlstr¨om Abstract In [B. Doerr, M. Gnewuch, P. Kritzer, F. Pillichshammer. Mo

Source URL: www.numerik.uni-kiel.de

• Quasirandomness
• Diophantine approximation
• Low-discrepancy sequence
• Numerical analysis
• Random number generation
• Randomized rounding
• Randomized algorithm
• Quasi-Monte Carlo method

Motivation Contributions A randomized online learning algorithm for better variance control

Source URL: imagine.enpc.fr

PDF Document

Source URL: www.math.stevens.edu

• Theory of computation
• Computational complexity theory
• Theoretical computer science
• Computability theory
• Analysis of algorithms
• Complexity classes
• Generic-case complexity
• Halting problem
• Time complexity
• Algorithm
• NP
• Randomized algorithm

PDF Document

Source URL: tcs.postech.ac.kr

• Theoretical computer science
• Algorithm
• Mathematical logic
• International Symposium on Algorithms and Computation
• Randomized algorithm

Homework #6 in Design and Analysis of Algorithms Part I Question 1 Let A be a randomized decision algorithm for some problem P (in particular, it may be a property testing algorithm (that performs an “approximate” d

Source URL: www.eng.tau.ac.il

Homework #5 in Design and Analysis of Algorithms Question 1 Let A be a randomized approximation algorithm for a certain counting problem such that given any input I to the problem and an approximation parameter 0 < ǫ <

Source URL: www.eng.tau.ac.il